Analysis of an Alignment Algorithm for Nonlinear Dimensionality Reduction
نویسندگان
چکیده
The goal of dimensionality reduction or manifold learning for a given set of highdimensional data points is to find a low-dimensional parametrization for them. Usually it is easy to carry out this parametrization process within a small region to produce a collection of local coordinate systems. Alignment is the process to stitch those local systems together to produce a global coordinate system and is done through the computation of a partial eigendecomposition of a so-called alignment matrix. In this paper, we present an analysis of the alignment process giving conditions under which the null space of the alignment matrix recovers the global coordinate system up to an affine transformation. We also propose a post-processing step that can determine the global coordinate system up to a rigid motion. This in turn shows that Local Tangent Space Alignment method (LTSA) can recover locally isometric embedding up to a rigid motion.
منابع مشابه
Adaptive Neighborhood Graph for LTSA Learning Algorithm without Free-Parameter
Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. In this paper, we present a nov...
متن کاملEigenvalues of an Alignment Matrix in Nonlinear Manifold Learning
The alignment algorithm of Zhang and Zha is an effective method recently proposed for nonlinear manifold learning (or dimensionality reduction). By first computing local coordinates of a data set, it constructs an alignment matrix from which a global coordinate is obtained from its null space. In practice, the local coordinates can only be constructed approximately and so is the alignment matri...
متن کاملPrincipal Manifolds and Nonlinear Dimension Reduction via Local Tangent Space Alignment
Nonlinear manifold learning from unorganized data points is a very challenging unsupervised learning and data visualization problem with a great variety of applications. In this paper we present a new algorithm for manifold learning and nonlinear dimension reduction. Based on a set of unorganized data points sampled with noise from the manifold, we represent the local geometry of the manifold u...
متن کاملSupervised Nonlinear Dimensionality Reduction Based on Evolution Strategy
Most of the classifiers suffer from the curse of dimensionality during classification of high dimensional image and non-image data. In this paper, we introduce a new supervised nonlinear dimensionality reduction (S-NLDR) algorithm called supervised dimensionality reduction based on evolution strategy (SDRES) for both image and nonimage data. The SDRES method uses the power of evolution strategy...
متن کاملPerformance Analysis of a Manifold Learning Algorithm in Dimension Reduction
We consider the performance of local tangent space alignment (Zhang and Zha, 2004), one of several manifold learning algorithms which has been proposed as a dimension reduction method, when errors are present in the observations. Matrix perturbation theory is applied to obtain a worst-case upper bound on the deviation of the solution, which is an invariant subspace. Although we only prove this ...
متن کامل